Large 2-Independent Sets of Regular Graphs
نویسندگان
چکیده
منابع مشابه
Large k-independent sets of regular graphs
We present a simple, yet efficient, heuristic for finding a large 2-independent set of regular graphs. We analyse the average-case performance of this heuristic, which is a randomised greedy algorithm, by analysing its performance on random regular graphs using differential equations. In this way, we prove lower bounds on the expected size of a largest 2-independent set of random regular graphs...
متن کاملLarge independent sets in regular graphs of large girth
Let G be a d-regular graph with girth g, and let α be the independence number of G. We show that α(G) ≥ 12 ( 1− (d− 1)−2/(d−2) − (g) ) n where (g) → 0 as g → ∞, and we compute explicit bounds on (g) for small g. For large g this improves previous results for all d ≥ 7. The method is by analysis of a simple greedy algorithm which was motivated by the differential equation method used to bound in...
متن کاملIndependent sets and cuts in large-girth regular graphs
We present a local algorithm producing an independent set of expected size 0.44533n on large-girth 3-regular graphs and 0.40407n on large-girth 4-regular graphs. We also construct a cut (or bisection or bipartite subgraph) with 1.34105n edges on large-girth 3regular graphs. These decrease the gaps between the best known upper and lower bounds from 0.0178 to 0.01, from 0.0242 to 0.0123 and from ...
متن کاملIndependent sets in quasi-regular graphs
New upper bounds for the number of independent sets in graphs are obtained. c © 2006 Published by Elsevier Ltd 1. Definitions and the statement of results All graphs under consideration are finite, undirected, and simple. The vertices are considered as numbered. Denote the degree of a vertex v by σ(v). G is called an (n, k, θ)-graph if it has n vertices and k ≤ σ(v) ≤ k + θ for any vertex v. Ev...
متن کاملINDEPENDENT SETS OF SOME GRAPHS ASSOCIATED TO COMMUTATIVE RINGS
Let $G=(V,E)$ be a simple graph. A set $Ssubseteq V$ isindependent set of $G$, if no two vertices of $S$ are adjacent.The independence number $alpha(G)$ is the size of a maximumindependent set in the graph. In this paper we study and characterize the independent sets ofthe zero-divisor graph $Gamma(R)$ and ideal-based zero-divisor graph $Gamma_I(R)$of a commutative ring $R$.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2003
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)81015-6